Exclusive-OR Representations of Boolean Functions
نویسندگان
چکیده
With the goal of making exclusive-OR formulations of switching functions more readily available to designers for implementation in L S I and VLSI technologies, we introduce the concept of an exclusive-OR space in which an exclusive-OR normal form is deJined to correspond to the conventional disjunctive normal form. A geometrical representation of exclusive-OR space is described, and its various bases are listed and discussed.
منابع مشابه
New Results for Sets of Boolean Functions
Traditionally Sum-Of-Products (SOPs) have been studied as expressions of Boolean functions. It has been shown by Sasao in [7] that Exclusive-or-Sum-Of-Products (ESOPs) are more compact representations of Boolean functions than SOPs. The problem to identify an exact minimal ESOP of a Boolean function is despite of some partial results still unsolved. Our new results rely on recently detected pro...
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملProbabilistic representation and manipulation of Boolean functions using free Boolean diagrams
The advent of increasingly dense and fast Very Large Scale Integrated (VLSI) circuits allows for the design of larger and more sophisticated digital logic circuits. Efficient logic representations are necessary for the synthesis, testing and verification of these circuits. This thesis introduces a new logic representation, called the Free Boolean Diagram (FBD). This representation can be manipu...
متن کاملXP2: A New Compact Representation for Manipulating Arithmetic Circuits
The complexity and performance of most algorithms used in logic synthesis depend greatly on the representation of input Boolean expression. In other words, finding an appropriate representation for Boolean expressions is a key problem in logic synthesis. This is the reason why plethora of representations such as Sum-of-Product (SOP), Product-of-Sum (POS), Binary Decision Diagram (BDD), Factored...
متن کاملA Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Incompletely Specified Boolean Functions using Variable Reordering
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary incompletely specified switching function taking into account the variable ordering. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IBM Journal of Research and Development
دوره 27 شماره
صفحات -
تاریخ انتشار 1983